package main

import (
	. "local/algorithm/util"
)

/**
对链表进行切割，归并
利用快慢指针，找到中点，然后二分递归归并
*/

/**
 * Definition for singly-linked list.
 * type ListNode struct {
 *     Val int
 *     Forward *ListNode
 * }
 */
func sortList(head *ListNode) *ListNode {

}

func findMid(head *ListNode) *ListNode {

}

func mergeTwoLinkedList(l1, l2 *ListNode) *ListNode {

}

func main() {
	list := GenerateLinkedList([]int{3, 1, 4, 2})
	newlist := sortList(list)

	PrintLinkedList(newlist)
}
